Graphs with the second largest number of maximal independent sets
نویسندگان
چکیده
منابع مشابه
Graphs with the second largest number of maximal independent sets
Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, maximum) independent sets in G. Erdős and Moser raised the problem of determining the maximum value of mi(G) among all graphs of order n and the extremal graphs achieving this maximum value. This problem was solved by Moon and Moser. Then it was studied for many special classes of grap...
متن کاملThe Second Largest Number of Maximal Independent Sets in Graphs with at Most Two Cycles
Amaximal independent set is an independent set that is not a proper subset of any other independent set. Jou and Chang determined the largest number of maximal independent sets among all graphs and connected graphs of order n, which contain at most one cycle. Later B. E. Sagan and V. R. Vatter found the largest number of maximal independent sets among all graphs of order n, which contain at mos...
متن کاملQuasi-Forest Graphs with the k-th Largest Number of Maximal Independent Sets
In this paper we complete the determination of the k-th (3 ≤ k ≤ bn−1 2 c) largest numbers of maximal independent sets among all quasiforest graphs of order n ≥ 8 and characterize the extremal graphs. Mathematics Subject Classification: 05C51
متن کاملOn the third largest number of maximal independent sets of graphs∗
Given a graph G = (VG,EG), a set I ⊆VG is independent if there is no edge of G between any two vertices of I. A maximal independent set is an independent set that is not a proper subset of any other independent set. The dual of an independent set is a clique, in the sense that clique corresponds to an independent set in the complement graph. The set of all maximal independent sets of a graph G ...
متن کاملIntegers for the Number of Maximal Independent Sets in Graphs
Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, maximum) independent sets in G. In this paper we determine the third and fouth largest value of mi(G) among all graphs of order n. Moreover, the extremal graphs achieving these values are also determined. Mathematics Subject Classification: 05C35, 05C69, 68R10
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.10.032